Computer minimization of incompletely specified logical functions
نویسندگان
چکیده
منابع مشابه
Recursive Decomposition of Sparse Incompletely-Specified Functions
A sparse function is one with only a few onset and offset minterms, compared to the entire input space. The paper examines effective use of the don’t cares to synthesize a small logic network. An algorithm is proposed, implemented and tested on known functions where only a small sample of care minterms is given. The algorithm is top-down recursive looking for decompositions based on two-input B...
متن کاملMinimization of exclusive sum-of-products expressions for multiple-valued input, incompletely specified functions
This paper presents a new operation (Exorlink) and an algorithm to minimize Exclusive-OR Sum-of-Products expressions (ESOPs) for multiple valued input, two valued output, incompletely speciied functions. Exorlink is a more powerful operation than the existing ones for this problem. Evaluation on benchmark functions is given and it proves the superiority of the program to those known from the li...
متن کاملExact Minimization of FPRMs for Incompletely Specified Functions by Using MTBDDs
Fixed polarity Reed-Muller expressions (FPRMs) exhibit several useful properties that make them suitable for many practical applications. This paper presents an exact minimization algorithm for FPRMs for incompletely specified functions. For an n-variable function with α unspecified minterms there are 2n+α distinct FPRMs, and a minimum FPRM is one with the fewest product terms. To find a minimu...
متن کاملSimulation-based verification of implementations of incompletely specified Boolean functions
The problem under discussion is to check whether a given system of incompletely specified Boolean functions is implemented by a logical description with functional indeterminacy that is represented by a system of connected blocks each of which is specified by a system of completely or incompletely specified Boolean functions. Simulationbased verification methods are considered which simulate th...
متن کاملSAT-based verification of implementations of incompletely specified Boolean functions
The problem under discussion is to check whether a given system of incompletely specified Boolean functions is implemented by a logical description with functional indeterminacy that is represented by a system of connected blocks each of which is specified by a system of completely or incompletely specified Boolean functions. SAT-based verification methods are considered which formulate the ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1966
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1966.103030